منابع مشابه
Double-base asymmetric AdaBoost
Based on the use of different exponential bases to define class-dependent error bounds, a new and highly efficient asymmetric boosting scheme, coined as AdaBoostDB (Double-Base), is proposed. Supported by a fully theoretical derivation procedure, unlike most of the other approaches in the literature, our algorithm preserves all the formal guarantees and properties of original (cost-insensitive)...
متن کاملCalibrating AdaBoost for Asymmetric Learning
Asymmetric classification problems are characterized by class imbalance or unequal costs for different types of misclassifications. One of the main cited weaknesses of AdaBoost is its perceived inability to handle asymmetric problems. As a result, a multitude of asymmetric versions of AdaBoost have been proposed, mainly as heuristic modifications to the original algorithm. In this paper we chal...
متن کاملExtending AdaBoost to Iteratively Vary Its Base Classifiers
This paper introduces AdaBoost Dynamic, an extension of AdaBoost.M1 algorithm by Freund and Shapire. In this extension we use different “weak” classifiers in subsequent iterations of the algorithm, instead of AdaBoost’s fixed base classifier. The algorithm is tested with various datasets from UCI database, and results show that the algorithm performs equally well as AdaBoost with the best possi...
متن کاملShedding light on the asymmetric learning capability of AdaBoost
Article history: Received 15 September 2010 Available online 22 November 2011 Communicated by F. Roli
متن کاملDouble-base scalar multiplication revisited
This paper reduces the number of field multiplications required for scalar multiplication on conservative elliptic curves. For an average 256-bit integer n, this paper’s multiply-by-n algorithm takes just 7.47M per bit on twisted Edwards curves −x + y = 1 + dxy with small d. The previous record, 7.62M per bit, was unbeaten for seven years. Unlike previous record-setting algorithms, this paper’s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2013
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2013.02.019